Computing in permutation and matrix groups. II. Backtrack algorithm
نویسندگان
چکیده
منابع مشابه
Computing in permutation groups without memory
Memoryless computation is a modern technique to compute any function of a set of registers by updating one register at a time while using no memory. Its aim is to emulate how computations are performed in modern cores, since they typically involve updates of single registers. The memoryless computation model can be fully expressed in terms of transformation semigroups, or in the case of bijecti...
متن کاملComputing conjugacy class representatives in permutation groups
We describe a significantly improved algorithm for computing the conjugacy classes of a finite permutation group with trivial soluble radical. We rely on existing methods for groups that are almost simple, and we are concerned here only with the reduction of the general case to the almost simple case. Dedicated to Charles Leedham-Green on the occasion of his 65th birthday
متن کاملPermutation groups, minimal degrees and quantum computing
We study permutation groups of given minimal degree without the classical primitivity assumption. We provide sharp upper bounds on the order of a permutation group H ≤ Sn of minimal degree m and on the number of its elements of any given support. These results contribute to the foundations of a non-commutative coding theory. A main application of our results concerns the Hidden Subgroup Problem...
متن کاملConstructing Permutation Representations for Matrix Groups
New techniques, both theoretical and practical, are presented for constructing permutation representations for computing with matrix groups defined over finite fields. The permutation representation is constructed on a conjugacy class of subgroups of prime order. We construct a base for the permutation representation, which in turn simplifies the computation of a strong generating set. In addit...
متن کاملComputing with matrix groups∗
A group is usually input into a computer by specifying the group either using a presentation or using a generating set of permutations or matrices. Here we will emphasize the latter approach, referring to [Si3, Si4, Ser1] for details of the other situations. Thus, the basic computational setting discussed here is as follows: a group is given, specified as G = 〈X〉 in terms of some generating set...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1982
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-1982-0669659-5